Deflation in Krylov Subspace Methods and Distance to Uncontrollability

نویسنده

  • Daniel Kressner
چکیده

The task of extracting from a Krylov decomposition the approximation to an eigenpair that yields the smallest backward error can be phrased as finding the smallest perturbation which makes an associated matrix pair uncontrollable. Exploiting this relationship, we propose a new deflation criterion, which potentially admits earlier deflations than standard deflation criteria. Along these lines, a new deflation procedure for shift-and-invert Krylov methods is developed. Numerical experiments demonstrate the merits and limitations of this approach. AMS subject classifications: 65F15, 65F50, 93B05.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deflation by Restriction for the Inverse-free Preconditioned Krylov Subspace Method

A deflation by restriction scheme is developed for the inverse-free preconditioned Krylov subspace method for computing a few extreme eigenvalues of the definite symmetric generalized eigenvalue problem Ax = λBx. The convergence theory for the inverse-free preconditioned Krylov subspace method is generalized to include this deflation scheme and numerical examples are presented to demonstrate th...

متن کامل

A Framework for Deflated and Augmented Krylov Subspace Methods

We consider deflation and augmentation techniques for accelerating the convergence of Krylov subspace methods for the solution of nonsingular linear algebraic systems. Despite some formal similarity, the two techniques are conceptually different from preconditioning. Deflation (in the sense the term is used here) “removes” certain parts from the operator making it singular, while augmentation a...

متن کامل

Spectral Deflation in Krylov Solvers: a Theory of Coordinate Space Based Methods

For the iterative solution of large sparse linear systems we develop a theory for a family of augmented and deflated Krylov space solvers that are coordinate based in the sense that the given problem is transformed into one that is formulated in terms of the coordinates with respect to the augmented bases of the Krylov subspaces. Except for the augmentation, the basis is as usual generated by a...

متن کامل

Krylov subspace methods for projected Lyapunov equations

We consider the numerical solution of projected Lyapunov equations using Krylov subspace iterative methods. Such equations play a fundamental role in balanced truncation model reduction of descriptor systems. We present generalizations of the extended block and global Arnoldi methods to projected Lyapunov equations and compare these methods with the alternating direction implicit method with re...

متن کامل

Deflation and Balancing Preconditioners for Krylov Subspace Methods Applied to Nonsymmetric Matrices

For quite some times, deflation preconditioner has been proposed and used to accelerate the convergence of Krylov subspace methods. For symmetric positive definite linear systems, convergence of CG combined with deflation has been analyzed and compared with other preconditioners, e.g. with the abstract balancing preconditioner [Nabben and Vuik, SIAM J. Sci. Comput., 27 (2006), pp. 1742–1759]. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006